Welcome![Sign In][Sign Up]
Location:
Search - kmean algorithm in c

Search list

[Mathimatics-Numerical algorithmsexer-kmean

Description: k均值算法实现聚类 c语言编写-k-means clustering algorithm c language
Platform: | Size: 29696 | Author: 胡素芳 | Hits:

[.netKmeans

Description: 在Visual C++.NET2003平台下实现聚类算法中的K-MEANS算法,对随机生成的点进行了聚类。使用单文档结构,并将聚类结果显示出来。-In the Visual C++. NET2003 platform clustering algorithm to achieve the K-MEANS algorithm, on randomly generated points in the cluster. Use a single document structure, and clustering results are displayed.
Platform: | Size: 63488 | Author: 杨维斌 | Hits:

[AI-NN-PRkmean

Description: 模式识别算法 k均值和感知器算法的具体实现实例-Pattern recognition algorithm for k-means algorithm and the perceptron realize specific examples
Platform: | Size: 177152 | Author: fengyuan | Hits:

[AI-NN-PRkmean

Description: kmean算法的c++实现,在vs2003上编译通过。-kmean algorithm c++ realize, in the VS2003 compiled through.
Platform: | Size: 1004544 | Author: ETSmallville | Hits:

[AI-NN-PRKMEAN

Description: 聚类分析算法中的最基本的K均值算法C++实现程序-Cluster analysis algorithm of the basic K-means algorithm C++ Realize procedures
Platform: | Size: 1024 | Author: 李超 | Hits:

[Algorithmkmean

Description: K-Means Clustering Algorithm implemented in C
Platform: | Size: 3072 | Author: Alak Roy | Hits:

[matlabkmean

Description: 包括K-均值聚类算法的思想介绍,kmeans的MATLAB代码,c语言代码、c++代码。-Including the K-means clustering algorithm introduced the idea, kmeans of MATLAB code, c language code, c++ code.
Platform: | Size: 10240 | Author: 刘斌 | Hits:

[AlgorithmKMean

Description: KMEAN C# In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data space into Voronoi cells. The problem is computationally difficult (NP-hard), however there are efficient heuristic algorithms that are commonly employed and converge fast to a local optimum. These are usually similar to the expectation-maximization algorithm for mixtures of Gaussian distributions via an iterative refinement approach employed by both algorithms. Additionally, they both use cluster centers to model the data, however k-means clustering tends to find clusters of comparable spatial extent, while the expectation-maximization mechanism allows clusters to have different shapes.
Platform: | Size: 2048 | Author: Truong | Hits:

CodeBus www.codebus.net